Doubly Optimal Secure and Protected Multicasting in Hierarchical Sensor Networks

This paper presents the research work addressing optimal secure and protected Multicasting in wired and wireless Hierarchical Sensor Networks (HSN). The multicast nodes in a hierarchical set up are associated with” Importance values” that are normalized into probabilities. The security constraint imposed is associated with the concept of “Prefix-free paths” in the associated graph. The optimality constraint is to minimize the average path length based on hop count from root node to multicast nodes. The paper also discusses doubly optimal secure multicasting. A practical Hierarchical Sensor Network is described. Some conditions for satisfying the Kraft inequality are also discussed. Doubly Optimal Secure and Protected Multicasting in Hierarchical Sensor Networks